TJHSST Senior Research Project Investigation of Minimal Conjugate Generators for the Symmetric Group and their Cayley Graphs 2007-2008

نویسنده

  • Jacob Steinhardt
چکیده

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets then lead to minimal highly symmetric generating sets of the symmetric group. We show that there exist generating sets among these with edge-transitive Cayley graphs and investigate them in relation to the Lovasz conjecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cayley graphs formed by conjugate generating sets of Sn

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first is a characterization of minimal conjugate generating sets of Sn. The second is a generalization of a result due to Feng characterizing the automorphism g...

متن کامل

Jacob Steinhardt Cayley graphs formed by conjugate generating sets of S n Jacob Steinhardt

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first is a characterization of minimal conjugate generating sets of Sn. The second is a generalization of a result due to Feng characterizing the automorphism g...

متن کامل

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q

A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.

متن کامل

NORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS

Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.  

متن کامل

Minimal cutwidth linear arrangements of abelian Cayley graphs

We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order. © 2007 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007